An extended shortest path problem: A data envelopment analysis approach
نویسندگان
چکیده
منابع مشابه
An Extended Shortest Path Problem with Switch Cost Between Arcs
Computing the shortest path in a graph is an important problem and it is very useful in various applications. The standard shortest path problem has been studied extensively and intensively, but it can’t handle the situation when there is a switch cost between arcs. For example, in a train transportation network, the switch cost between arcs contains waiting time in stations, times of transfer ...
متن کاملSBM extended model with nonlinear value data in data envelopment analysis with axiomatic approach
One of the important goals of banks as important economic enterprises of any country is to increase economic efficiency. One of the important goals of banks as important economic enterprises of any country is to increase economic efficiency. The classical approach to data envelopment analysis models takes into account the linear valuation function for all indicators. But linear valuation in man...
متن کاملAn extended of multiple criteria data envelopment analysis models for ratio data
One of the problems of the data envelopment analysis traditional models in the multiple form that is the weights corresponding to certain inputs and outputs are considered zero in the calculation of efficiency and this means that not all input and output components are utilized for the evaluation of efficiency, as some are ignored. The above issue causes the efficiency score of the under evalua...
متن کاملA Common Weight Data Envelopment Analysis Approach for Material Selection
Material selection is one of the major problems in manufacturing environments since the improper selected material may lead to fail in the production processes and result in customer dissatisfaction and cost inefficiency. Every material has different properties which should be considered as major criteria during the material selection procedure. Selection criteria could be quantitative or quali...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2012
ISSN: 0893-9659
DOI: 10.1016/j.aml.2012.02.042